Column basis reduction and decomposable knapsack problems
نویسندگان
چکیده
منابع مشابه
Column basis reduction and decomposable knapsack problems
We propose a very simple preconditioning method for integer programming feasibility problems: replacing the problem b ≤ Ax ≤ b x ∈ Zn with b ≤ (AU)y ≤ b y ∈ Zn, where U is a unimodular matrix computed via basis reduction, to make the columns of AU short (i.e. have small Euclidean norm), and nearly orthogonal (see e.g. [20], [17]). Our approach is termed column basis reduction, and the reformula...
متن کاملHulls and Order Decomposable Problems
In this paper we consider dynamic data structures for Order Decomposable Problems. This dass of Problems indude the Convex Hull Problem, the Voronoi Diagram Problem, the Maxima Problem and the Intersection of Half Spaces. This paper first describes a scheme for maintaining convex hulls in the plane dynamically in O(logn) amortized time for insert ions and O(log2n ) time for deletions. O(n) spac...
متن کاملDecomposable Searching Problems
In this paper we will investigate transformations that serve as tools in the design of new data structures. Specifically, we study general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches). We will exhibit three classes of such transformations, each b...
متن کاملMulti-dimensional Knapsack Problems
This chapter reviews our recent work on applying hybrid collaborative techniques that integrate Branch and Bound (B&B) and Memetic Algorithms (MAs) in order design effective heuristics for the Multidimensional Knapsack Problem (MKP). To this end, let us recall that Branch and Bound (B&B) [1] is an exact algorithm for finding optimal solutions to combinatorial problems, that, basically works by ...
متن کاملYet harder knapsack problems
Already 30 years ago, Chvátal has shown that some instances of the zero-one knapsack problem cannot be solved in polynomial time using a particular type of branch-and-bound algorithms based on relaxations of linear programs together with some rudimentary cutting-plane arguments as bounding rules. We extend this result by proving an exponential lower bound in a more general class of branch-and-b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2009
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2009.01.003